#include<iostream>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_set>
#include<bits/stdc++.h>
#define fi first
#define se second
#define SIZE(x) ((int)x.size())
#define out(x) cerr<<#x<<" = "<<(x)<<endl;
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
#define VI vector<int>
#define VVI vector< vector<int> >
#define VL vector<ll>
#define VVL vector<VL >
#define VC vector<char>
#define PI pair<int,int>
#define PL pair<ll,ll>
#define EPS 0.0000001


inline int lson(int x){return x<<1;}
inline int rson(int x){return (x<<1)|1;}

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}

template<typename T> 
inline void read(T &x){
	x=0;T f=1;char ch;
	do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
	do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}


//#define INF 5340172838076674L
#define INF 1000000000
#define MOD 1000000007

struct node{
	int a,b,c;
	bool operator<(const node& x)const{
		if(a!=x.a)return a<x.a;
		return b>x.b;
	};
};

void extgcd(ll a,ll b,ll &x,ll &y){
	if(b==0){
		x=1;y=0;
		return;
	}
	extgcd(b,a%b,y,x);
	y-=(a/b)*x;
}

ll ai[5000005];
ll si[5000005];
ll _ai[5000005];
ll _si[5000005];

//洛谷P5431
int main(){
    #ifdef BUG
    freopen("a.in","r",stdin);
    #endif
	int n=read();
	ll p=read(),k=read(),ki=k;
	for(int i=1;i<=n;i++)ai[i]=read()%p;
	si[0]=1;
	for(int i=1;i<=n;i++)si[i]=(ai[i]*si[i-1])%p;
	ll x,y;
	extgcd(si[n],p,x,y);
	x=(x%p)+p;
	_si[n]=x;
	for(int i=n;i>=1;i--){
		_ai[i]=(si[i-1]*_si[i])%p;
		_si[i-1]=(ai[i]*_si[i])%p;
	}
	ll res=0;
	for(int i=1;i<=n;i++){
		res=(res+ki*_ai[i])%p;
		ki=(ki*k)%p;
	}
	cout<<res<<endl;
}